A General Framework for Inference on Algorithm-Agnostic Variable Importance
نویسندگان
چکیده
In many applications, it is of interest to assess the relative contribution features (or subsets features) toward goal predicting a response—in other words, gauge variable importance features. Most recent work on assessment has focused describing within confines given prediction algorithm. However, such does not necessarily characterize potential features, and may provide misleading reflection intrinsic value these To address this limitation, we propose general framework for nonparametric inference interpretable algorithm-agnostic importance. We define as population-level contrast between oracle predictiveness all available versus except those under consideration. efficient estimation procedure that allows construction valid confidence intervals, even when machine learning techniques are used. also outline strategy testing null hypothesis. Through simulations, show our proposal good operating characteristics, illustrate its use with data from study an antibody against HIV-1 infection. Supplementary materials article online.
منابع مشابه
Statistical Inference for Variable Importance
Many statistical problems involve the learning of an importance/effect of a variable for predicting an outcome of interest based on observing a sample of n independent and identically distributed observations on a list of input variables and an outcome. For example, though prediction/machine learning is, in principle, concerned with learning the optimal unknown mapping from input variables to a...
متن کاملA General Agnostic Active Learning Algorithm
We present a simple, agnostic active learning algorithm that works for any hypothesis class of bounded VC dimension, and any data distribution. Our algorithm extends a scheme of Cohn, Atlas, and Ladner to the agnostic setting, by (1) reformulating it using a reduction to supervised learning and (2) showing how to apply generalization bounds even for the non-i.i.d. samples that result from selec...
متن کاملA general framework for statistical inference on discrete event systems
We present a framework for statistical analysis of discrete event systems which combines tools such as simulation of marked point processes, likelihood methods, kernel density estimation and stochastic approximation to enable statistical analysis of the discrete event system, even if conventional approaches fail due to the mathematical intractability of the model. The approach is illustrated wi...
متن کاملA Framework for Network-Agnostic Multiplayer Games
Producing computer games is a complex and resourceintensive task nowadays. Since this task involves many people with a great variety of expertise, a clear separation of concerns within the project is essential. Especially multiplayer online functionality, which is probably the most popular aspect currently, raises the complexity significantly. Getting this aspect separated allows game developer...
متن کاملA Particle Swarm Optimization Algorithm for Mixed-Variable Nonlinear Problems
Many engineering design problems involve a combination of both continuous anddiscrete variables. However, the number of studies scarcely exceeds a few on mixed-variableproblems. In this research Particle Swarm Optimization (PSO) algorithm is employed to solve mixedvariablenonlinear problems. PSO is an efficient method of dealing with nonlinear and non-convexoptimization problems. In this paper,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2022
ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']
DOI: https://doi.org/10.1080/01621459.2021.2003200